A pangram is a sentence where every letter of the English alphabet appears at least once.
Given a string sentence
containing only lowercase English letters, return true
ifsentence
is a pangram, orfalse
otherwise.
Input: sentence = "thequickbrownfoxjumpsoverthelazydog" Output: true Explanation: sentence contains at least one of every letter of the English alphabet.
Input: sentence = "leetcode" Output: false
1 <= sentence.length <= 1000
sentence
consists of lowercase English letters.
implSolution{pubfncheck_if_pangram(sentence:String) -> bool{ sentence.bytes().fold(0, |acc, c| match c {b'A'..=b'Z' => acc | (1 << (c - b'A')),b'a'..=b'z' => acc | (1 << (c - b'a')), _ => acc,}) == (1 << 26) - 1}}